A Report on Learning With Errors over Rings
نویسنده
چکیده
Cryptography based on lattices is the use of conjectured hard problems on point lattices in Rn as the basis for security in cryptosystems. In this report, firstly we introduce lattices and some hard problems based on lattice then present some of the major developments in lattice-based cryptography. The main focus in this report is on the fundamental learning with errors (LWE) problems, Ring-LWE and its cryptographic applications.
منابع مشابه
A New Ring-Based SPHF and PAKE Protocol On Ideal Lattices
emph{ Smooth Projective Hash Functions } ( SPHFs ) as a specific pattern of zero knowledge proof system are fundamental tools to build many efficient cryptographic schemes and protocols. As an application of SPHFs, emph { Password - Based Authenticated Key Exchange } ( PAKE ) protocol is well-studied area in the last few years. In 2009, Katz and Vaikuntanathan described the first lattice-based ...
متن کاملMulti-bit homomorphic encryption based on learning with errors over rings
Zhang Wei, Liu Shuguang, Yang Xiaoyuan Key Lab of Computer Network and Information Security under CAPF, Shaanxi 710086, China [email protected] Abstract:Basing on Learning with errors over rings (RLWE) assumption, we provide a new multi-bit somewhat homomorphic encryption scheme. We introduce canonical embedding to transform a ring element into a vector, such that polynomial multiplication ca...
متن کاملMulti-bit homomorphic encryption based on learning with errors over rings
Basing on Learning with errors over rings (RLWE) assumption, we provide a new multi-bit somewhat homomorphic encryption scheme. We introduce canonical embedding to transform a ring element into a vector, such that polynomial multiplication can be performed in ~ (nlog n) scalar operations, and ciphertext size is reduced at the same time. The CPA security of this scheme can be reduced into RLWE...
متن کاملOn nest modules of matrices over division rings
Let $ m , n in mathbb{N}$, $D$ be a division ring, and $M_{m times n}(D)$ denote the bimodule of all $m times n$ matrices with entries from $D$. First, we characterize one-sided submodules of $M_{m times n}(D)$ in terms of left row reduced echelon or right column reduced echelon matrices with entries from $D$. Next, we introduce the notion of a nest module of matrices with entries from $D$. We ...
متن کاملOn Ring Learning with Errors over the Tensor Product of Number Fields
The “Ring Learning with Errors” (RLWE) problem was formulated as a variant of the “Learning with Errors” (LWE) problem, with the purpose of taking advantage of an additional algebraic structure in the underlying considered lattices; this enables improvements on the efficiency and cipher expansion on those cryptographic applications which were previously based on the LWE problem. In Eurocrypt 20...
متن کامل